Tham khảo Chặn Chernoff

Ahlswede, R.; Winter, A. (2003). “Strong Converse for Identification via Quantum Channels”. IEEE Transactions on Information Theory 48 (3): 569–579. arXiv:quant-ph/0012127.
Chernoff, H. (1952). “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations”. Annals of Mathematical Statistics 23 (4): 493–507. JSTOR 2236576. MR 57518. Zbl 0048.11804. doi:10.1214/aoms/1177729330.
Hoeffding, W. (1963). “Probability Inequalities for Sums of Bounded Random Variables”. Journal of the American Statistical Association 58 (301): 13–30. JSTOR 2282952. doi:10.2307/2282952.
Chernoff, H. (1981). “A Note on an Inequality Involving the Normal Distribution”. The Annals of Probability 9 (3): 533. JSTOR 2243541. MR 614640. Zbl 0457.60014. doi:10.1214/aop/1176994428.
Hagerup, T. (1990). “A guided tour of Chernoff bounds”. Information Processing Letters 33 (6): 305. doi:10.1016/0020-0190(90)90214-I.
Mitzenmacher, M.; Upfal, E. (2005). Probability and Computing: Randomized Algorithms and Probabilistic Analysis. ISBN 9780521835404.
Nielsen, F. (2011). "Chernoff information of exponential families". arΧiv:1102.2684 [cs.IT].

Liên quan

Tài liệu tham khảo